Metastability and Small Eigenvalues in Markov Chains

نویسندگان

  • Anton Bovier
  • Michael Eckhoff
  • Véronique Gayrard
  • Markus Klein
چکیده

In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available. This includes a sharp uncertainty principle relating all low-lying eigenvalues to mean times of metastable transitions, a relation between the support of eigenfunctions and the attractor of a metastable state, and sharp estimates on the convergence of probability distribution of the metastable transition times to the exponential distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metastability and Typical Exit Paths

In this paper we review and discuss results on metastability. We consider ergodic aperiodic Markov chains with exponentially small transition probabilities and we give a complete description of the typical tube of trajectories during the rst excursion outside a general domain Q.

متن کامل

Tunneling and Metastability of continuous time Markov chains

We propose a new definition of metastability of Markov processes on countable state spaces. We obtain sufficient conditions for a sequence of processes to be metastable. In the reversible case these conditions are expressed in terms of the capacity and of the stationary measure of the metastable states.

متن کامل

Metastability and Dominant Eigenvalues of Transfer Operators

We prove upper and lower bounds for the metastability of a statespace decomposition for reversible Markov processes in terms of dominant eigenvalues and eigenvectors of the corresponding transfer operator. The bounds are explicitly computable and sharp. In contrast to many other approaches, the results do not rely on any asymptotic expansions in terms of some smallness parameter, but rather hol...

متن کامل

Algorithms for Faster and Larger Dynamic Metropolis Simulations

In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for longer times and to simulate larger systems. The longer-time algorithm focused on is the Monte Carlo with Absorbing Markov Chains (MCAMC) algorithm. It is applied to metastabilit...

متن کامل

Taylor Expansion for the Entropy Rate of Hidden Markov Chains

We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000